Fast Isometric Parametrization of 3D Triangular Mesh
نویسندگان
چکیده
In this paper we describe a new mesh parametrization method that is both computationally efficient and yields minimized distance errors. The method has four steps. First, the multidimensional scaling is used to locally flatten each vertex. Second, an optimal method is used to compute the linear reconstructing weights of each vertex with respect to its neighbours. Thirdly, a spectral decomposition method is used to obtain initial 2D parametrization coordinates. Fourthly, we rotate and scale the initial coordinates to minimize the distance errors. Examples are provided to show the effectiveness of this parametrization method compared with alternatives.
منابع مشابه
As-rigid-as-possible spherical parametrization
In this paper, we present an efficient approach for parameterizing a genus-zero triangular mesh onto the sphere with an optimal radius in an as-rigid-as-possible (ARAP) manner, which is an extension of planar ARAP parametrization approach to spherical domain. We analyze the smooth and discrete ARAP energy and formulate our spherical parametrization energy from the discrete ARAP energy. The solu...
متن کاملFast Spherical Mapping for Genus-0 Meshes
Parameterizing a genus-0 mesh onto a unit sphere means assigning a 3D position on the unit sphere to each vertex of the mesh, such that the spherical mapping induced by the mesh connectivity is not too distorted and does not have overlapping areas. The non-overlapping requirement is technically the most difficult component also the most critical component of many spherical parametrization metho...
متن کاملFast Morphing of Triangular Meshes in Shape Space
We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model morphs as linear interpolations in a suitable shape space S. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in R. We then extend this shape space to arbitrary triangulations in 3D using ...
متن کاملApplication of the fast marching method for outdoor motion planning in robotics
In this paper, a new path planning method for robots used in outdoors environments is presented. The proposed method applies Fast Marching to a 3D surface represented with a triangular mesh to calculate a smooth trajectory from one point to another. The method uses a triangular mesh instead of a square mesh since this kind of grid adapts better to 3D surfaces. The novelty of this approach is th...
متن کاملEvenly Spaced Streamlines for Surfaces: An Image-Based Approach
We introduce a novel, automatic streamline seeding algorithm for vector fields defined on surfaces in 3D space. The algorithm generates evenly spaced streamlines fast, simply and efficiently for any general surface-based vector field. It is general because it handles large, complex, unstructured, adaptive resolution grids with holes and discontinuities, does not require a parametrization, and c...
متن کامل